A Private and Consistent Data Retrieval Scheme with Log-Squared Communication

نویسندگان

  • Satoshi Nakayama
  • Maki Yoshida
  • Shingo Okamura
  • Toru Fujiwara
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Oblivious Transfer Protocol with Log-Squared Communication

We propose a one-round 1-out-of-n computationally-private information retrieval protocol for `-bit strings with low-degree polylogarithmic receivercomputation, linear sender-computation and communication Θ(k · log n + ` · log n), where k is a possibly non-constant security parameter. The new protocol is receiver-private if the underlying length-flexible additively homomorphic public-key cryptos...

متن کامل

Private Data Base Access Schemes Avoiding Data Distribution

In this thesis we introduce and solve three privacy problems in Secure Database Access protocols: Database Privacy, the Data Replication Problem, and the Secure user Identity problem. Database Privacy is concerned with keeping the databases information secure from the user. The Data Replication problem (DRP) deals with a new security concern for databases that emanates from the need to replicat...

متن کامل

Private Information Storage

We consider the setting of hiding information through the use of multiple databases that do not interact with one another. In this setting, there are k 2 \databases" which can be accessed by some \users". Users do not keep any state information, but wish to access O(n) bits of \data". Previously, in this setting solutions for retrieval of data in the eecient manner were given, where a user achi...

متن کامل

A T-private K-database Private Information Retrieval Scheme

A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k repli-cated databases. The scheme is information-theoretically secure against coalitions of databases of size t k ? 1. It improves the communication complexity of the scheme described in 12] for coalitions of ...

متن کامل

A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost

Existing single server Private Information Retrieval (PIR) protocols are far from practical. To be practical, a single server PIR protocol has to be both communicationally and computationally efficient. In this paper, we present a single server PIR protocol that has low communication cost and is much faster than existing protocols. A major building block of the PIR protocol in this paper is a t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Transactions

دوره 90-A  شماره 

صفحات  -

تاریخ انتشار 2007